Search results for "Binary predicate"

showing 1 items of 1 documents

Logics with counting and equivalence

2014

We consider the two-variable fragment of first-order logic with counting, subject to the stipulation that a single distinguished binary predicate be interpreted as an equivalence. We show that the satisfiability and finite satisfiability problems for this logic are both NEXPTIME-complete. We further show that the corresponding problems for two-variable first-order logic with counting and two equivalences are both undecidable.

Discrete mathematicsLogical equivalenceComplexityHigher-order logicSatisfiabilityUndecidable problemStipulationCombinatoricsBinary predicateTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESEquivalence relationComputer Science::Logic in Computer ScienceEquivalence relationSatisfiabilityEquivalence (formal languages)MathematicsProceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
researchProduct